Syntactic Uni cation Problem under Constrained Substitutions
نویسندگان
چکیده
منابع مشابه
Syntactic Uni cation Problems under Constrained Substitutions
Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملAn Algebraic Approach to Sharing Analysis of Logic Programs
Terms and Atoms Syntactically, we assume a set of variables V and an underlying alphabet = f ; ;g consisting of a single binary function symbol which \glues" elements together and a single constant symbol ; to represent the empty set. Abstract terms, or set expressions, are elements of the term algebra T ( ;V) modulo an equality theory consisting of the following axioms: (x y) z = x (y z) (asso...
متن کاملOpacity in the lexicon: a generative lexicon approach to Korean VV compounds
is paper aims at providing a formal description of three types of Korean compounds made up of two verbs (VV compounds) in the Generative Lexicon framework. I will rst discuss several properties commonly ascribed to VV compounds and address the problem of identifying lexical VV compounds as opposed to SVCs and similar constructions. I will then argue that the complex semantic structure and the ...
متن کاملHigher-Order Equational Unification via Explicit Substitutions
We show how to reduce the uniication problem modulo-conversion and a rst-order equational theory E, into a rst-order uni-cation problem in a union of two non-disjoint equational theories including E and a calculus of explicit substitutions. A rule-based uniica-tion procedure in this combined theory is described and may be viewed as an extension of the one initially designed by G. Dowek, T. Hard...
متن کامل